Time-Memory Analysis of Parallel Collision Search Algorithms
نویسندگان
چکیده
منابع مشابه
Parallel Local Search Algorithms
In general, neural networks are regarded as models for massively parallel computation. But very often, this parallelism is rather limited, especially when considering symmetric networks. For instance, Hoppeld networks do not really compute in parallel as their updating algorithm always requires sequential execution. We describe a recurrent network corresponding to a symmetric network and introd...
متن کاملParallel Collision Search with Radix Trees
Parallel versions of collision search algorithms require a significant amount of memory to store a proportion of the points computed by the pseudo-random walks. Implementations available in the literature use a hash table to store these points to allow fast memory access. We propose to replace the traditional hash table by a radix tree structure, allowing both look-up and insertion in a single ...
متن کاملPractical Parallel External Memory Algorithms via Simulation of Parallel Algorithms
This thesis introduces PEMS2, an improvement to PEMS (Parallel External Memory System). PEMS executes Bulk-Synchronous Parallel (BSP) algorithms in an External Memory (EM) context, enabling computation with very large data sets which exceed the size of main memory. Many parallel algorithms have been designed and implemented for Bulk-Synchronous Parallel models of computation. Such algorithms ge...
متن کاملEntropic and Real-Time Analysis of the Search with Panmictic, Structured, and Parallel Distributed Genetic Algorithms
It has been a well-known fact that genetic algorithms (GAs) get part of their success from the efficient exploration/exploitation balance. This equilibrium is related to the population diversity decreasing rate. This rate is not the same for all GAs, but it depends on the reproductive cycle being used. In particular, steady-state (μ+1)-GAs (ssGA) have a larger convergence rate than traditional ...
متن کاملParallel Algorithms in External Memory
External memory (EM) algorithms are designed for computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. The Parallel Disk Model (PDM) of Vitter and Shriver is widely used to discriminate between external memory algorithms on the basis of input/output (I/O) complexity. Parallel algorithms are designed to e ciently utilize the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR Transactions on Cryptographic Hardware and Embedded Systems
سال: 2021
ISSN: 2569-2925
DOI: 10.46586/tches.v2021.i2.254-274